CATEGORIFYING RATIONALIZATION
نویسندگان
چکیده
منابع مشابه
Categorifying Rationalization
We solve a problem proposed by Khovanov by constructing, for any set of primes S, a triangulated category (in fact a stable∞-category) whose Grothendieck group is S−1Z. More generally, for any exact∞-category E, we construct an exact∞-category S−1E of equivariant sheaves on the Cantor space with respect to an action of a dense subgroup of the circle. We show that this∞-category is precisely the...
متن کاملCategorifying the zx-calculus
This paper presents a symmetric monoidal and compact closed bicategory that categorifies the zx-calculus developed by Coecke and Duncan. The 1-cells in this bicategory are certain graph morphisms that correspond to the string diagrams of the zx-calculus, while the 2-cells are rewrite rules.
متن کاملRationalization of Freeform Surfaces
An ever broader availability of freeform designs together with an increasing demand for product customization has lead to a rising interest in efficient physical realization of such designs, the trend toward personal fabrication. Not only large-scale architectural applications are (becoming increasingly) popular but also different consumer-level rapid-prototyping applications, including toy and...
متن کاملReason-Based Rationalization
We introduce a “reason-based” way of rationalizing an agent’s choice behaviour, which explains choices by specifying which properties of the options or choice context the agent cares about (the “motivationally salient properties”) and how he or she cares about these properties (the “fundamental preference relation”). Reason-based rationalizations can explain non-classical choice behaviour, incl...
متن کاملRationalization and Incomplete Information∗
We analyze a family of extensive-form solution procedures for games with incomplete information that do not require the specification of an epistemic type space à la Harsanyi, but can accommodate a (commonly known) collection of explicit restrictions ∆ on first-order beliefs. For any fixed ∆ we obtain a solution called ∆-rationalizability. In static games, ∆-rationalizability characterizes the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Forum of Mathematics, Sigma
سال: 2019
ISSN: 2050-5094
DOI: 10.1017/fms.2019.26